Geometric and Higher Order Logic in terms of Abstract Stone Duality

The contravariant powerset, and its generalisations Σ to the lattices of open subsets of a locally compact topological space and of recursively enumerable subsets of numbers, satisfy the Euclidean principle that φ ∧ F (φ) = φ ∧ F (>). Conversely, when the adjunction Σ(−) a Σ(−) is monadic, this equation implies that Σ classifies some class of monos, and the Frobenius law ∃x.(φ(x) ∧ ψ) = (∃x.φ(x)) ∧ ψ for the existential quantifier. In topology, the lattice duals of these equations also hold, and are related to the Phoa principle in synthetic domain theory. The natural definitions of discrete and Hausdorff spaces correspond to equality and inequality, whilst the quantifiers considered as adjoints characterise open (or, as we call them, overt) and compact spaces. Our treatment of overt discrete spaces and open maps is precisely dual to that of compact Hausdorff spaces and proper maps. The category of overt discrete spaces forms a pretopos and the paper concludes with a converse of Paré’s theorem (that the contravariant powerset functor is monadic) that characterises elementary toposes by means of the monadic and Euclidean properties together with all quantifiers, making no reference to subsets.